The obnoxious facilities planar p-median problem

In this paper, we propose the planar obnoxious facilities p-median problem. problem objective is to find p locations for that minimize weighted sum of distances between communities and their closest facility. version, add constraints each facility must be located at least a certain distance from partial set because they generate nuisance affecting these communities. The resulting extremely non-convex traditional nonlinear solvers such as SNOPT are not efficient. An efficient solution method based on Voronoi diagrams proposed tested. We also constructed frontiers test problems, showing trade-off required objective, assist planers in making location decisions.